The N 10 - Matrix Completion Problem
نویسنده
چکیده
An n×n matrix is called an N1 0 -matrix if all its principal minors are non-positive and each entry is non-positive. In this paper, we study general combinatorially symmetric partial N1 0 -matrix completion problems and prove that a combinatorially symmetric partial N1 0 -matrix with all specified offdiagonal entries negative has an N1 0 -matrix completion if the graph of its specified entries is an undirected cycle or a 1-chordal graph.
منابع مشابه
Graph Matrix Completion in Presence of Outliers
Matrix completion problem has gathered a lot of attention in recent years. In the matrix completion problem, the goal is to recover a low-rank matrix from a subset of its entries. The graph matrix completion was introduced based on the fact that the relation between rows (or columns) of a matrix can be modeled as a graph structure. The graph matrix completion problem is formulated by adding the...
متن کاملThe Nonsingular Matrix Completion Problem
An n × n matrix is called a principally nonsingular matrix (NSmatrix) if all its principal minors are different from zero and it is called a totally nonsingular matrix (TNS-matrix) if all its minors are different from zero. In this paper, we are interested in the NS-matrix (TNSmatrix) completion problem: whether a partial NS-matrix (TNS-matrix) has a NS-matrix (TNS-matrix) completion. Here, we ...
متن کاملThe nonnegative Q − matrix completion problem
In this paper, the nonnegative Q-matrix completion problem is studied. A real n × n matrix is a Q-matrix if for k ∈ {1, . . . , n}, the sum of all k × k principal minors is positive. A digraph D is said to have nonnegative Q-completion if every partial nonnegative Q-matrix specifying D can be completed to a nonnegative Q-matrix. For nonnegative Q-completion problem, necessary conditions and suf...
متن کاملThe Q-matrix completion problem
Abstract. A real n × n matrix is a Q-matrix if for every k = 1, 2, . . . , n the sum of all k × k principal minors is positive. A digraph D is said to have Q-completion if every partial Q-matrix specifying D can be completed to a Q-matrix. For the Q-completion problem, sufficient conditions for a digraph to have Q-completion are given, necessary conditions for a digraph to have Q-completion are...
متن کاملThe partial non - combinatorially symmetric N 10 - matrix completion problem
An n×n matrix is called an N 0 -matrix if all principal minors are non-positive and each entry is non-positive. In this paper, we study the partial non-combinatorially symmetric N 0 -matrix completion problems if the graph of its specified entries is a transitive tournament or a double cycle. In general, these digraphs do not have N 0 -completion. Therefore, we have given sufficient conditions ...
متن کاملMinimizing the Condition Number of a Positive Deenite Matrix by Completion
We consider the problem of minimizing the spectral condition number of a positive deenite matrix by completion: minfcond(positive deeniteg; where A is an n n Hermitian positive deenite matrix, B a p n matrix and X is a free p p Hermitian matrix. We reduce this problem to an optimization problem for a convex function in one variable. Using the minimal solution of this problem we characterize the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013